Simulation of Extended Resource Constrained Scheduling Problem with a Soft Computed Priority Heuristic

In the recent decade, numerous researchers have proposed extended version of scheduling problem named as multimode resource constrained scheduling problem (MMRCSP), claiming it to be a more practical way of capturing production characteristics. However, this flexibility comes with increased complexity. The present work proposes a framework for such multimode scheduling problems in order to provide solution via simulation of various heuristics and execution strategies. It allows user to select preferred parameters for transparent scheduling as compared to the commercial scheduling softwares which behave like a black box. As this extended constrained scheduling problem involves decision of activity allocation time and choice of performing method (mode option), the proposed framework provides heuristics for both decisions. The aim of the newly proposed heuristic for listing activity priorities is to incorporate the information of position, slack and size of an activity according to the project network characteristics. Additionally, a non-greedy heuristic has been adopted for selection of a performing method described as mode option. The developed framework seeks to aid decision manager for multiple trade-offs among cost, time and resource utilization in case of an in-exact optimal; a situation widely encountered in the field of operations management. Keywords—Heuristics; Scheduling; Multi-modes; Simulation